Catching Change-points with Lasso
نویسندگان
چکیده
We propose a new approach for dealing with the estimation of the location of change-points in one-dimensional piecewise constant signals observed in white noise. Our approach consists in reframing this task in a variable selection context. We use a penalized least-squares criterion with a `1-type penalty for this purpose. We prove some theoretical results on the estimated change-points and on the underlying piecewise constant estimated function. Then, we explain how to implement this method in practice by combining the LAR algorithm and a reduced version of the dynamic programming algorithm and we apply it to synthetic and real data.
منابع مشابه
The group fused Lasso for multiple change-point detection
We present the group fused Lasso for detection of multiple change-points shared by a set of cooccurring one-dimensional signals. Change-points are detected by approximating the original signals with a constraint on the multidimensional total variation, leading to piecewise-constant approximations. Fast algorithms are proposed to solve the resulting optimization problems, either exactly or appro...
متن کاملChange-point estimators with true identification property
The change-point problem is reformulated as a penalized likelihood estimation problem. A new non-convex penalty function is introduced to allow consistent estimation of the number of change points, and their locations and sizes. Penalized likelihood methods based on LASSO and SCAD penalties may not satisfy such a property. The asymptotic properties for the local solutions are established and nu...
متن کاملChange-Point Estimation in High Dimensional Regression Models
We consider high dimensional nonhomogeneous linear regression models with p n 9 0 or p >> n, where p is the number of features and n is the number of observations. In the model considered, the underlying true regression coefficients undergo multiple changes. Our goal is to estimate the number and locations of these change-points and estimate sparse coefficients in each of the intervals between ...
متن کاملCatching Growth Determinants with the Adaptive Lasso
This paper uses the adaptive Lasso estimator to determine variables important for economic growth. The adaptive Lasso estimator is a computationally very efficient procedure that simultaneously performs model selection and parameter estimation. The computational cost of this method is negligibly small compared with standard approaches in the growth regressions literature. We apply this method f...
متن کاملNonlinear regression modeling and spike detection via Gaussian basis expansions
We consider the problem of constructing nonlinear regression models in the case that the structure of data has abrupt change points at unknown points. We propose two stage procedure where the spikes are detected by fused lasso signal approximator at the first stage, and the smooth curve are effectively estimated along with the technique of regularization method at the second. In order to select...
متن کامل